Agent-based distance vector routing: a resource efficient and scalable approach to routing in large communication networks
نویسندگان
چکیده
منابع مشابه
An Evolutionary Approach to Distance Vector Routing
Distance vector routing algorithms operate by having each router maintain a table giving the best known distance to each destination and which line to use to get there. Genetic algorithms are search algorithms based on mechanics of natural selection and natural genetics. To overcome some of the problems of traditional adaptive routing techniques genetic algorithms can be used. GAs have the cap...
متن کاملSecuring Distance-vector Routing Protocols Securing Distance-vector Routing Protocols
The security requirements of distance-vector routing protocols are analyzed, their vulnerabilities identi ed, and countermeasures to these vulnerabilities are proposed. The innovation presented involves the use of mechanisms from the pathnding class of distancevector protocols as a solution to the security problems of distance-vector protocols. The result is the rst proposal to e ectively and e...
متن کاملA resource-efficient and scalable wireless mesh routing protocol
By binding logic addresses to the network topology, routing can be carried out without going through route discovery. This eliminates the initial route discovery latency, saves storage space otherwise needed for routing table, and reduces the communication overhead and energy consumption. In this paper, an adaptive block addressing (ABA) scheme is first introduced for logic address assignment a...
متن کاملScalable Cluster-based Routing in Large Wireless Sensor Networks
Large control overhead is the leading factor limiting the scalability of wireless sensor networks (WSNs). Clustering network nodes is an efficient solution, and Passive Clustering (PC) is one of the most efficient clustering methods. In this letter, we propose an improved PC-based route building scheme, named Route Reply (RREP) Broadcast with Passive Clustering (in short RBPC). Through broadcas...
متن کاملEfficient routing on multilayered communication networks
We study the optimal routing on multilayered communication networks, which are composed of two layers of subnetworks. One is a wireless network, and the other is a wired network. We develop a simple recurrent algorithm to find an optimal routing on this kind of multilayered network, where the single-channel transmission mode and the multichannel transmission mode used on the wireless subnetwork...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems and Software
سال: 2004
ISSN: 0164-1212
DOI: 10.1016/s0164-1212(03)00007-4